@book{epstein08,
author = {Richard L. Epstein and Walter A. Carnielli},
title = {Computability: Computable Functions, Logic, And The Foundations of Mathematics},
year = {2008},
edition = {3rd},
publisher = {Advanced  Reasoning Forum},
abstract = { Principal referência, livro de Dick, contem as provas mais importantes.},
}

@misc{adamchik05,
 author = {Victor Adamchik},
 year = {2005},
 monht = {August},
 title = {21-127: Concepts of Mathematics - Recursions},
 howpublished = {\url{http://www.cs.cmu.edu/~adamchik/21-127/lectures/recursion_1_print.pdf}},
 abstract = {Discute o tema tendo em vista recursão: apresenta recursão simples e dupla recursão, citando o exemplo da função de Arquimedes.},
 }
 
 @misc{nordstrom08,
 author = {Bengt Nordström},
 year = {2008},
 title = {Models of Computation 2008 (TDA 183) -  Primitive recursive functions},
 howpublished = {\url{http://www.cs.chalmers.se/Cs/Grundutb/Kurser/naber/prf.pdf}},
 abstract = {Apresenta historical remarks interessantes.},
 }
 
 @misc{fuhrmann04,
 author = {Carsten Führmann}, 
 year = {2004},
 title = {CM10020: Computability and decidability - Recursive functions - Part 2: primitive recursion (second part) \& minimization},
 howpublished = {\url{http://www.cs.bath.ac.uk/~cf/cm10020/lecture12.pdf}},
 abstract = {Prova informal das funções de ackermann - formato de slides},
 }
 
 @misc{sieg06,
 author = {Wilfried Sieg}, 
 year = {2006},
 title = {Foundations of Computability - Computability Theory},
 howpublished = {\url{http://www.phil.cmu.edu/summerschool/2006/Sieg/computability_theory.pdf}},
 abstract = {Grande arquivo texto com várias notações sobre a história de ackermann},
 }
 
 @ARTICLE{wichmann76,
    author = {B. A. Wichmann},
    title = {Ackermann’s Function: A Study in the Efficiency of Calling Procedures},
    journal = {BIT},
    year = {1976},
    volume = {16},
    pages = {103--110},
    abstract = {Os 3 artigos de wichmann trabalha com o uso da função para testar performance.}
}
 
@ARTICLE{wichmann77,
    author = {B. A. Wichmann},
    title = {How To Call Procedures, or Second Thoughts on Ackermann’s Function. Software Practice and Experience 7},
    journal = {Software — Practice and Experience. Vol},
    year = {1977},
    volume = {7},
    pages = {317--329}
}
 
 @TECHREPORT{wichmann82,
    author = {B. A. Wichmann},
    title = {Latest Results from the Procedure Calling Test, Ackermann’s Function},
    institution = {National Physics Laboratory, Teddington, Middlesex TW11 0LW},
    year = {1982}
}
 
 @misc{bellin08,
 author = {Gianluigi Bellin},
 year = {2008},
 title = {Computability - Handout 5: Ackermann Function},
 howpublished = {\url{www.dcs.qmul.ac.uk/~bellin/ackermann08.pdf}},
 abstract = {Prova que a função é total; prova que não é primitivo recursiva (e que majora)},
 }
 
 @misc{tourlakis08,
 author = {George Tourlakis}, 
 year = {2008},
 title = {Ackermann's Function},
 howpublished = {\url{www.cse.yorku.ca/~gt/papers/Ackermann-function.pdf}},
 abstract = {Outra prova.},
 }
 
 @misc{rosetta09,
 author = {Rosetta Code}, 
 year = {2009},
 title = {Rosetta Code: Ackermann Function},
 howpublished = {\url{http://rosettacode.org/wiki/Ackermann_Function}},
 abstract = {Diversas implementações de Ackermann},
 }
 
 @misc{wikipedia09,
 author = {Wikipedia}, 
 year = {2009},
 title = {Ackermann function},
 howpublished = {\url{http://en.wikipedia.org/wiki/Ackermann_function}},
 abstract = {},
 }
 
 @misc{shoutout09,
 author = {Debian.org}, 
 year = {2009},
 title = {The Computer Language Benchmarks Game - Recursive Tests},
 howpublished = {\url{http://shootout.alioth.debian.org/gp4/benchmark.php?test=recursive&lang=all}},
 abstract = {},
 }